The Palindromic Generalized Eigenvalue Problem A∗x = λAx: Numerical Solution and Applications
نویسندگان
چکیده
In this paper, we propose the palindromic doubling algorithm (PDA) for the palindromic generalized eigenvalue problem (PGEP) A∗x = λAx. We establish a complete convergence theory of the PDA for PGEPs without unimodular eigenvalues, or with unimodular eigenvalues of partial multiplicities two (one or two for eigenvalue 1). Some important applications from the vibration analysis and the optimal control for singular descriptor linear systems will be presented to illustrate the feasibility and efficiency of the PDA.
منابع مشابه
Structured doubling algorithms for solving g-palindromic quadratic eigenvalue problems∗
The T-palindromic quadratic eigenvalue problem (λB + λC + A)x = 0, with A,B,C ∈ Cn×n, C = C and B = A, governs the vibration behavior of trains. One way to solve the problem is to apply a structure-preserving doubling algorithm (SDA) to the nonlinear matrix equation (NME) X + BX−1A = C and “square-root” the matrix quadratic involved. In this paper, we generalize the SDA for the solution of (odd...
متن کاملA NEW APPROACH TO THE SOLUTION OF SENSITIVITY MINIMIZATION IN LINEAR STATE FEEDBACK CONTROL
In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigen...
متن کاملStructure-Preserving Algorithms for Palindromic Quadratic Eigenvalue Problems Arising from Vibration of Fast Trains
In this paper, based on Patel’s algorithm (1993), we proposed a structure-preserving algorithm for solving palindromic quadratic eigenvalue problems (QEPs). We also show the relationship between the structure-preserving algorithm and the URV-based structure-preserving algorithm by Schröder (2007). For large sparse palindromic QEPs, we develop a generalized >skew-Hamiltonian implicity-restarted ...
متن کاملIterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کاملNumerical analysis of a quadratic matrix equation
The quadratic matrix equation AX2 + B X +C = 0 in n ×n matrices arises in applications and is of intrinsic interest as one of the simplest nonlinear matrix equations. We give a complete characterization of solutions in terms of the generalized Schur decomposition and describe and compare various numerical solution techniques. In particular, we give a thorough treatment of functional iteration m...
متن کامل